Testing protocols modeled as FSMs with timing parameters 1 ̈

نویسندگان

  • M. Umit Uyar
  • Mariusz A. Fecko
  • Adarshpal S. Sethi
  • Paul D. Amer
چکیده

An optimization method is introduced for generating minimum-length test sequences taking into account timing constraints for FSM models of communication protocols. Due to active timers in many of today’s protocols, the number of consecutive self-loops that can be traversed in a given state before a timeout occurs is limited. A test sequence that does not consider timing constraints will likely be unrealizable in a test laboratory, thereby potentially resulting in the incorrect failing Ž . of valid implementations or, vice versa . The solution uses a series of augmentations for a protocol’s directed graph representation. The resulting test sequence is proven to be of minimum-length while not exceeding the tolerable limit of consecutive self-loops at each state. Although UIO sequences are used for state verification method, the results also are applicable to test generation that uses distinguishing or characterizing sequences. q 1999 Elsevier Science B.V. All rights reserved.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A Conformance Testing Method for Communication Protocols Modeled as Concurrent DFSMs

According to the progress of high-speed networks, many communication protocols are specified as concurrent systems. Such systems can be modeled as concurrent deterministic FSMs (DFSMs). In those protocols, a common input may be taken by some of concurrent DFSMs competitively. In such a case, the global behaviour becomes non-deterministic in general. Conformance testing is typically a black-box ...

متن کامل

Testing protocols modeled as FSMs with timing parameters

An optimization method is introduced for generating minimum-length test sequences taking into account timing constraints for FSM models of communication protocols. Due to active timers in many of today’s protocols, the number of consecutive self-loops that can be traversed in a given state before a timeout occurs is limited. A test sequence that does not consider timing constraints will likely ...

متن کامل

An Eclipse-based environment for conformance testing by FSMs

Finite state machines (FSMs) represent a very simple yet widely used formalism. They are used to model simple protocols or even complex systems in an abstract way. Java classes often behave like FSMs. For these reasons, FSMs are often used in conformance testing, which consists in checking that a real implementation conforms with its speci cation given in terms of a FSM. In this paper, we show ...

متن کامل

A complete testing strategy based on interacting and hierarchical FSMs

Control-dominated devices are usually modeled as a composition of nite state machines. FSMs can be hierarchically composed to dominate the modeling complexity or can be aggregated into an interacting architecture to partition a complex behavior. A hierarchical or interacting FSMs based representation can be extracted from a device's description given by means of a hardware description language....

متن کامل

Test development for communication protocols: towards automation

In this paper we give an introduction to methods and tools for testing communication protocols and distributed systems. In this context, we try to answer the following questions: Why are we testing? What are we testing? Against what are we Ž testing?... We present the different approaches of test automation and explain the industrial point of view automatic test . Ž . execution and the research...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1999